control flow graph

control flow graph
= CFG
граф потока (потоков) управления
абстрактный способ описания последовательности операций (команд), выполняемых процессором. Программисты визуально представляют ход программы с учётом, например, таких управляющих конструкций, как if...then...else, и подпрограмм (процедур), которым управление "передаётся" и от которых "возвращается". Граф [потоков] управления позволяет увидеть логику программы и определить, работает ли она так, как задумано. В частности, такой граф описывает, как программный счётчик может проходить процедуру. Узлами графа потока управления являются базовые блоки (максимальные линейные сегменты команд, basic block), дуги показывают передачи управления (обычно переходы)

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Поможем написать реферат

Смотреть что такое "control flow graph" в других словарях:

  • Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution …   Wikipedia

  • Control flow analysis — is a static code analysis technique for determining the control flow of a program. The control flow is expressed as a control flow graph (CFG). For many languages, the control flow of a program is explicit in a program s source code. As a result …   Wikipedia

  • Control flow — Not to be confused with Flow control. In computer science, control flow (or alternatively, flow of control) refers to the order in which the individual statements, instructions, or function calls of an imperative or a declarative program are… …   Wikipedia

  • Control flow diagram — Example of a so called performance seeking control flow diagram .[1] A control flow diagram (CFD) is a diagram to describe the control flow of a business process, process or program. Contr …   Wikipedia

  • Signal-flow graph — A signal flow graph (SFG) is a special type of block diagram[1] and directed graph consisting of nodes and branches. Its nodes are the variables of a set of linear algebraic relations. An SFG can only represent multiplications and additions.… …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Control theory — For control theory in psychology and sociology, see control theory (sociology) and Perceptual Control Theory. The concept of the feedback loop to control the dynamic behavior of the system: this is negative feedback, because the sensed value is… …   Wikipedia

  • Flow (computer networking) — In a Packet Switching network, a packet flow or traffic flow is a sequence of packets from one particular source (e.g. a computer host, process or class of service) to a single destination (another computer host, multicast group, broadcast domain …   Wikipedia

  • Data-flow analysis — is a technique for gathering information about the possible set of values calculated at various points in a computer program. A program s control flow graph (CFG) is used to determine those parts of a program to which a particular value assigned… …   Wikipedia

  • Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… …   Wikipedia

  • GRaPH-Int — The Genome based Research and Population Health International Network (GRaPH Int) is an international collaboration of experts and researchers focused in the area of population health. The principal goal of the network is to promote the… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»